Fast Evaluation Techniques for Complex Similarity Queries
نویسندگان
چکیده
Complex similarity queries, i.e., multi-feature multi-object queries, are needed to express the information need of a user against a large multimedia repository. Even if a user initially issues a single-object query over one feature, a system with relevance feedback will automatically generate a complex similarity query. Relevance feedback is only useful if response times are interactive. Therefore, this article contributes to the important problem how to evaluate such complex queries efficiently. We describe a new evaluation technique called Generalized VA-File-based Search (GeVAS). It builds on the VA-File [27], supports queries over several feature types, and borrows the idea to search an index structure with several query objects in parallel from Ciaccia et al. [8]. Our main contributions are twofold: 1) we show that GeVAS does not degenerate for queries with many objects or many feature types. 2) We develop a number of variants of GeVAS, tailored to the different distance measures and distancecombining functions, and we show that they yield a significant performance improvement.
منابع مشابه
Efficiently Supporting Multiple Similarity Queries for Mining in Metric Databases
Metric databases are databases where a metric distance function is defined for pairs of database objects. In such databases, similarity queries in the form of range queries or k-nearest neighbor queries are the most important queries. In traditional query processing, single queries are issued independently by different users. In many data mining applications, however, the database is typically ...
متن کاملCalculating Similarity of Arbitrary Reports
Abstract Reporting is an essential part of business, today, and people spend a lot of time creating meaningful visualizations of their most important data. Surprisingly, the reuse of reports (i.e., applying the same visualization or query on di↵erent data) is not common. The recommendation of proven, existing queries represents one part of this reuse. Since there are several report formats and ...
متن کاملSpatial database support for virtual engineering
The development, design, manufacturing and maintenance of modern engineering products is a very expensive and complex task. Shorter product cycles and a greater diversity of models are becoming decisive competitive factors in the hard-fought automobile and plane market. In order to support engineers to create complex products when being pressed for time, systems are required which answer collis...
متن کاملMultiple Similarity Queries: A Basic DBMS Operation for Mining in Metric Databases
Metric databases are databases where a metric distance function is defined for pairs of database objects. In such databases, similarity queries in the form of range queries or k-nearest neighbor queries are the most important query types. In traditional query processing, single queries are issued independently by different users. In many data mining applications, however, the database is typica...
متن کاملProcessing Complex Similarity Queries with Distance-Based Access Methods
Efficient evaluation of similarity queries is one of the basic requirements for advanced multimedia applications. In this paper, we consider the relevant case where complex similarity queries are defined through a generic language L and whose predicates refer to a single feature F . Contrary to the language level which deals only with similarity scores, the proposed evaluation process is based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001